Fast reoptimization of Steiner trees: Changing the Edge set
نویسندگان
چکیده
In this paper, we discuss the problem of reoptimization of Steiner tree. We are given an instance of Graph and also an optimal Steiner tree of it. If some changes occurs later on in the given graph. New optimal Steiner tree is to be determine, this process is known as re optimization. We consider two cases of change: one is addition of a new edge and second is, Deletion of an existing edge. For both the cases, we provide approximation algorithms with corresponding approximation ratio equal to (1+d) where 0
منابع مشابه
Reoptimization of Steiner trees: Changing the terminal set
Given an instance of the Steiner tree problem together with an optimal solution, we consider the scenario where this instance is modified locally by adding one of the vertices to the terminal set or removing one vertex from it. In this paper, we investigate the problem whether the knowledge of an optimal solution to the unaltered instance can help in solving the locally modified instance. Our r...
متن کاملRobust Reoptimization of Steiner Trees
In reoptimization problems, one is given an optimal solution to a problem instance and a local modification of the instance. The goal is to obtain a solution for the modified instance. The additional information about the instance provided by the given solution plays a central role: we aim to use that information in order to obtain better solutions than we are able to compute from scratch. In t...
متن کاملThe Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
In this paper, we deal with several reoptimization variants of the Steiner tree problem in graphs obeying a sharpened β-triangle inequality. A reoptimization algorithm exploits the knowledge of an optimal solution to a problem instance for finding good solutions for a locally modified instance. We show that, in graphs satisfying a sharpened triangle inequality (and even in graphs where edge-cos...
متن کاملSimple and Fast Reoptimizations for the Steiner Tree Problem
We address reoptimization issues for the Steiner tree problem. We assume that an optimal solution is given for some instance of the problem and the objective is to maintain a good solution when the instance is subject to minor modifications, the simplest such modifications being vertex insertions and deletions. We propose fast reoptimization strategies for the case of vertex insertions and we s...
متن کاملReoptimization of TSP and Steiner Tree: Changing single edge-weights
We consider the following optimization problem: Given an instance of an optimization problem and some optimum solution for this instance, we want to find a good solution for a slightly modified instance. Additionally, the scenario is addressed where the solution for the original instance is not an arbitrary optimum solution, but is chosen among all optimum solutions in a most helpful way. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010